Akizuki's Counterexample

نویسنده

  • Miles Reid
چکیده

Following [Akizuki], I construct a Noetherian local integral domain CM whose normalisation (integral closure) is not finite over CM . My proof follows closely Akizuki’s ingenious calculations. Let A be a DVR with local parameter t and residue field k = A/(t), and  the completion of A. There are no restrictions on the characteristic of A or k, but I assume that  contains a transcendental element over A. (For DVRs of interest,  usually has infinite transcendence degree over A.) The rings B, C constructed below, and their localisations, are intermediate subrings between A and Â. The construction depends on a power series z = z0 = a0 + a1t n1 + a2t n2 + · · · ∈ Â, (1) (not just on the element z). Assume: (2) Each ai ∈ A is a unit. (3) nr ≥ 2nr−1 + 2 for every r ≥ 1, where I set n0 = 0; for example, the smallest possible choice is nr = 2(2 r − 1) = 0, 2, 6, 14, 30, . . . . (4) z is transcendental over A, so that A ⊂ A[z] ⊂  is a polynomial extension. Akizuki’s construction is as follows: for r ≥ 0, let zr = z0 − first r terms tnr = ar + ar+1t mr+1 + · · · , where mr = nr − nr−1 so that (3) gives 2mr ≥ nr + 2. (5) This paper was written during a stay at the semestre “Surfaces de Riemann et fibrés vectoriels” of the Centre Emile Borel, paid for by the EEC HCM project AGE (Algebraic Geometry in Europe), contract number ERBCHRXCT 940557.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generating Diagnoses for Probabilistic Model Checking Using Causality

One of the major advantages of model checking over other formal methods of verification is its ability to generate an error trace when the specification is falsified in the model. We call this trace a counterexample. In probabilistic model checking (PMC), counterexample generation has a quantitative aspect. The counterexample is a set of paths in which a path formula holds, and their accumulate...

متن کامل

A 64-Dimensional Counterexample to Borsuk's Conjecture

Bondarenko’s 65-dimensional counterexample to Borsuk’s conjecture contains a 64-dimensional counterexample. It is a two-distance set of 352 points.

متن کامل

Debugging of Markov Decision Processes (MDPs) Models

In model checking, a counterexample is considered as a valuable tool for debugging. In Probabilistic Model Checking (PMC), counterexample generation has a quantitative aspect. The counterexample in PMC is a set of paths in which a path formula holds, and their accumulative probability mass violates the probability threshold. However, understanding the counterexample is not an easy task. In this...

متن کامل

An Abstract Framework for Counterexample Analysis in Active Automata Learning

Counterexample analysis has emerged as one of the key challenges in Angluin-style active automata learning. Rivest and Schapire (1993) showed for the L∗ algorithm that a single suffix of the counterexample was sufficient to ensure progress. This suffix can be obtained in a binary search fashion, requiring Θ(logm) membership queries for a counterexample of length m. Correctly implementing this a...

متن کامل

Counterexample Generation for Incomplete Designs

Counterexample generation is a crucial task for error diagnosis and debugging of sequential circuits. The simpler a counterexample is – i.e. more general and fewer assigned input values – the better it can be understood by humans. We will use the concept of Black Boxes – parts of the design with unknown behavior – to mask out components for counterexample computation. By doing this, the resulti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995